Coverings, matchings and paired domination in fuzzy graphs using strong arcs
نویسندگان
چکیده مقاله:
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the strong paired domination number of fuzzy graphs. An upper bound for the strong paired domination number of fuzzy graphs in terms of strong independence number is also obtained.
منابع مشابه
Connected domination in fuzzy graphs using strong arcs
Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...
متن کاملTotal Domination in Fuzzy Graphs Using Strong Arcs
In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملPaired-domination in inflated graphs
The inflation GI of a graph G with n(G) vertices and m(G) edges is obtained from G by replacing every vertex of degree d of G by a clique Kd. A set S of vertices in a graph G is a paired dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired domination number γp(G) is the minimum cardinality of a paired d...
متن کاملPaired- and induced paired-domination in (E, net)-free graphs
A dominating set of a graph is a vertex subset that any vertex belongs to or is adjacent to. Among the many well-studied variants of domination are the so-called paired-dominating sets. A paired-dominating set is a dominating set whose induced subgraph has a perfect matching. In this paper, we continue their study. We focus on graphs that do not contain the net-graph (obtained by attaching a pe...
متن کاملThe Strong Domination Alteration Sets in Fuzzy Graphs
In this paper, the effect of the removal of a node or an arc of a fuzzy graph on the minimum strong dominating set of the fuzzy graph is studied. The motivation behind this study is the identification of fault tolerance in the topological design of a network. That is, the ability of the network to provide service even when it contains a faulty component or components. MSC: 05C69.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 16 شماره 1
صفحات 145- 157
تاریخ انتشار 2019-02-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023